An Integer-Linear-Programming-Based Routing Algorithm for Flip-Chip Designs
نویسندگان
چکیده
منابع مشابه
An Integer Linear Programming Algorithm for Crosstalk-Constrained River Routing
As advances in technology produce smaller interconnection wire spacing and higher circuit operating frequency, the effect of crosstalks on performance and even on yield in integrated circuit design and manufacturing thus increases rapidly. Consequently, reduction of crosstalks between interconnection wires has become important in VLSI (very large scale integration) design. In this paper, an app...
متن کاملAn efficient RDL routing for flip-chip designs
Engineers use a redistribution layer (RDL) in flip-chip designs to redistribute I/O pads to bump pads without changing the I/O pad placement. However, traditional routing capacity may be insufficient to handle sizable designs, in which the RDL may be very congested and especially when there is a less-than-optimal I/O-bump assignment. As a result, routing may not be completed within a single lay...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملInteger Linear Programming Models for Global Routing
M integrated circuit design involves the layout of circuits consisting of millions of switching elements or transistors. Due to the sheer complexity of the problem, optimizing the connectivity between transistors is very difficult. The circuit interconnection is the single most important factor in performance criteria such as signal delay, power dissipation, circuit size, and cost. These factor...
متن کاملA Routing Direction and Remapping Based Algorithm For Flip-Chip Routing
The flip-chip package provides the best solution that has the highest chip density in all package technologies to support the pad-limited VLSI designs. In this paper, we propose a routing algorithm for the flip-chip package. The routing algorithm can search a suitable routing path from bump pads to driver pads and route each of them. In this routing algorithm, there are four stages including Cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2009
ISSN: 0278-0070
DOI: 10.1109/tcad.2008.2009151